Attractors of Sequences of Iterated Function Systems

نویسنده

  • RYAN BRODERICK
چکیده

If F and G are iterated function systems, then any infinite word W in the symbols F and G induces a limit set. It is natural to ask whether this Cantor set can also be realized as the limit set of a single C iterated function system H. We prove that under certain assumptions on F and G, the answer is no. This problem is motivated by the spectral theory of one-dimensional quasicrystals.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Iterated Function Systems

discrete iterated function systems discrete iterated function systems representation of discrete sequences with dimensional discrete iterated function systems discrete iterated function systems stochastic discrete scale invariance: renormalization representation of discrete sequences with high-dimensional power domains and iterated function systems fractal tilings from iterated function systems...

متن کامل

[inria-00510143, v1] Construction of fractals using formal languages and matrices of attractors

LRIFS's (Language-Restricted Iterated Function Systems) generalize the original de nition of IFS's (Iterated Function Systems) by providing tools for restricting the sequences of applicable transformations.In this paper, we study an approach of LRIFS's based on matrices and graph theory. This enables us to generate a matrix which elements are attractors.

متن کامل

Escape-time Visualization Method for Language-restricted Iterated Function Systems

The escape-time method was introduced to generate images of Julia and Mandelbrot sets, then applied to visualize attractors of iterated function systems. This paper extends it further to language-restricted iterated function systems (LRIFS's). They generalize the original de nition of IFS's by providing means for restricting the sequences of applicable transformations. The resulting attractors ...

متن کامل

Rotation number and its properties for iterated function and non-autonomous systems  

The main purpose of this paper is to introduce the rotation number for non-autonomous and iterated function systems. First, we define iterated function systems and the lift of these types of systems on the unit circle. In the following, we define the rotation number and investigate the conditions of existence and uniqueness of this number for our systems. Then, the notions rotational entropy an...

متن کامل

Connectedness of the Attractors of Iterated Function Systems

We survey some of the topological properties of the attractors of iterated function systems such as connectedness, arcwise connectedness and locally arcwise connectedness. We give necessary and sufficient conditions for the attractors of finite iterated function system (IFS) to be a connected sets and in the case when infinite iterated function systems (IIFS) are considered we give only some su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016